Step of Proof: stable__from_decidable
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
stable
from
decidable
:
P
:
. Dec(
P
)
Stable{
P
}
latex
by ((Unfolds ``decidable stable`` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n
C
),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
1.
P
:
C1:
2.
P
(
P
)
C1:
3.
P
C1:
P
C
.
Definitions
t
T
,
P
Q
,
Stable{
P
}
,
Dec(
P
)
,
P
Q
,
,
x
:
A
.
B
(
x
)
Lemmas
not
wf
origin